River Crake (at Bouthrey Bridge) freeze coring report

This is the River Crake (at Bouthrey Bridge) freeze coring report produced by Lancaster University in 1999. This study looks at fine materials in river Crake at Bouthrey Bridge that may have to be considered detrimental to successful salmonid spawning. Following an observed decline in quality of salmonid fisheries at the site an investigation was initiated to assess the extent of ingress of fine sediments into the spawning gravels. Fine sediments from one potential source, upstream riverbanks, are also compared to those isolated from the spawning gravels. The percentage by weight of fine sediments for the six freeze cores, was found to be lower than first expected, given the visual appearance of the reach. However the fines were found to be distributed evenly down the cores with a marked absence of an upper, coarse gravel armour layer. In addition the median grain size (D50) of the six samples was generally low, falling to 6mm for core 5. The low median grain size and the absence of coarse grained upper strata are considered detrimental to the success rate of salmonid spawning

Experimental Evaluation of Nearest Neighbor Exploration Approach in Field Environments

© 2017 IEEE. Inspecting surface conditions in 3-D environments such as steel bridges is a complex, time-consuming, and often hazardous undertaking that is an essential part of tasks such as bridge maintenance. Developing an autonomous exploration strategy for a mobile climbing robot would allow for such tasks to be completed more quickly and more safely than is possible with human inspectors. The exploration strategy tested in this paper, called the nearest neighbors exploration approach (NNEA), aims to reduce the overall exploration time by reducing the number of sensor position evaluations that need to be performed. NNEA achieves this by first considering at each time step only a small set of poses near to the current robot as candidates for the next best view. This approach is compared with another exploration strategy for similar robots performing the same task. The improvements between the new and previous strategy are demonstrated through trials on a test rig, and also in field trials on a ferromagnetic bridge structure. Note to Practitioners-This paper was motivated by the problem of inspecting confined spaces for rust and flaking paint with a manipulator robot arm. Existing approaches involve creating a large set of candidate robot poses to take a scan from. Evaluating all these candidate poses is very time consuming if full coverage is guaranteed. This paper suggests a principled method for restricting the size of this set in a way that does not reduce inspection coverage but decreases overall time taken for inspection

A sliding window approach to exploration for 3D map building using a biologically inspired bridge inspection robot

© 2015 IEEE. This paper presents a Sliding Window approach to viewpoint selection when exploring an environment using a RGB-D sensor mounted to the end-effector of an inchworm climbing robot for inspecting areas inside steel bridge archways which cannot be easily accessed by workers. The proposed exploration approach uses a kinematic chain robot model and information theory-based next best view calculations to predict poses which are safe and are able to reduce the information remaining in an environment. At each exploration step, a viewpoint is selected by analysing the Pareto efficiency of the predicted information gain and the required movement for a set of candidate poses. In contrast to previous approaches, a sliding window is used to determine candidate poses so as to avoid the costly operation of assessing the set of candidates in its entirety. Experimental results in simulation and on a prototype climbing robot platform show the approach requires fewer gain calculations and less robot movement, and therefore is more efficient than other approaches when exploring a complex 3D steel bridge structure

Key feature-based approach for efficient exploration of structured environments

© 2015 IEEE. This paper presents an exploration approach for robots to determine sensing actions that facilitate the building of surface maps of structured partially-known environments. This approach uses prior knowledge about key environmental features to rapidly generate an estimate of the rest of the environment. Specifically, in order to quickly detect key features, partial surface patches are used in combination with pose optimisation to select a pose from a set of nearest neighbourhood candidates, from which to make an observation of the surroundings. This paper enables the robot to greedily search through a sequence of nearest neighbour poses in configuration space, then converge upon poses from which key features can best be observed. The approach is experimentally evaluated and found to result in significantly fewer exploration steps compared to alternative approaches

Systematical, experimental investigations on LiMgZ (Z= P, As, Sb) wide band gap semiconductors

This work reports on the experimental investigation of the wide band gap compounds LiMgZ (Z = P, As, Sb), which are promising candidates for opto-electronics and anode materials for Lithium batteries. The compounds crystallize in the cubic (C1_b) MgAgAs structure (space group F-43m). The polycrystalline samples were synthesized by solid state reaction methods. X-ray and neutron diffraction measurements show a homogeneous, single-phased samples. The electronic properties were studied using the direct current (DC) method. Additionally UV-VIS diffuse reflectance spectra were recorded in order to investigate the band gap nature. The measurements show that all compounds exhibit semiconducting behavior with direct band gaps of 1.0 eV to 2.3 eV depending on the Z element. A decrease of the peak widths in the static 7Li nuclear magnetic resonance (NMR) spectra with increasing temperature was observed, which can directly be related to an increase of Li ion mobility.Comment: 8 page

Expanding wavefront frontier detection: An approach for efficiently detecting frontier cells

Frontier detection is a key step in many robot exploration algorithms. The more quickly frontiers can be detected, the more efficiently and rapidly exploration can be completed. This paper proposes a new frontier detection algorithm called Expanding Wavefront Frontier Detection (EWFD), which uses the frontier cells from the previous timestep as a starting point for detecting the frontiers in the current timestep. As an alternative to simply comparing against the naive frontier detection approach of evaluating all cells in a map, a new benchmark algorithm for frontier detection is also presented, called Naive Active Area frontier detection, which operates in bounded constant time. EWFD and NaiveAA are evaluated in simulations and the results compared against existing state-of-the-art frontier detection algorithms, such as Wavefront Frontier Detection and Incremental-Wavefront Frontier Detection

Exploring in 3D with a climbing robot: Selecting the next best base position on arbitrarily-oriented surfaces

© 2016 IEEE. This paper presents an approach for selecting the next best base position for a climbing robot so as to observe the highest information gain about the environment. The robot is capable of adhering to and moving along and transitioning to surfaces with arbitrary orientations. This approach samples known surfaces, and takes into account the robot kinematics, to generate a graph of valid attachment points from which the robot can either move to other positions or make observations of the environment. The information value of nodes in this graph are estimated and a variant of A∗ is used to traverse the graph and discover the most worthwhile node that is reachable by the robot. This approach is demonstrated in simulation and shown to allow a 7 degree-of-freedom inchworm-inspired climbing robot to move to positions in the environment from which new information can be gathered about the environment

Efficient neighbourhood-based information gain approach for exploration of complex 3D environments

This paper presents an approach for exploring a complex 3D environment with a sensor mounted on the end effector of a robot manipulator. In contrast to many current approaches which plan as far ahead as possible using as much environment information as is available, our approach considers only a small set of poses (vector of joint angles) neighbouring the robot's current pose in configuration space. Our approach is compared to an existing exploration strategy for a similar robot. Our results demonstrate a significant decrease in the number of information gain estimation calculations that need to be performed, while still gathering an equivalent or increased amount of information about the environment. © 2013 IEEE

Approaches for Efficiently Detecting Frontier Cells in Robotics Exploration.

Many robot exploration algorithms that are used to explore office, home, or outdoor environments, rely on the concept of frontier cells. Frontier cells define the border between known and unknown space. Frontier-based exploration is the process of repeatedly detecting frontiers and moving towards them, until there are no more frontiers and therefore no more unknown regions. The faster frontier cells can be detected, the more efficient exploration becomes. This paper proposes several algorithms for detecting frontiers. The first is called Naïve Active Area (NaïveAA) frontier detection and achieves frontier detection in constant time by only evaluating the cells in the active area defined by scans taken. The second algorithm is called Expanding-Wavefront Frontier Detection (EWFD) and uses frontiers from the previous timestep as a starting point for searching for frontiers in newly discovered space. The third approach is called Frontier-Tracing Frontier Detection (FTFD) and also uses the frontiers from the previous timestep as well as the endpoints of the scan, to determine the frontiers at the current timestep. Algorithms are compared to state-of-the-art algorithms such as Naïve, WFD, and WFD-INC. NaïveAA is shown to operate in constant time and therefore is suitable as a basic benchmark for frontier detection algorithms. EWFD and FTFD are found to be significantly faster than other algorithms